Improved Algorithms for Partial Curve Matching
نویسندگان
چکیده
منابع مشابه
Exact algorithms for partial curve matching via the Fréchet distance
Curve matching is a fundamental problem that occurs in many applications. In this paper, we study the problem of measuring partial similarity between curves. Specifically, given two curves, we wish to maximize the total length of subcurves that are close to each other, where closeness is measured by the Fréchet distance, a common distance measure for curves. The resulting maximal length is call...
متن کاملPartial Curve Matching under the Fréchet Distance∗
Curve matching is a fundamental problem which occurs in many applications. In this paper, we extend the Fréchet distance to measure partial curve similarity, study its properties, and develop efficient algorithms to compute it. In particular, under the L1 or L∞ metrics, we present an algorithm to compute, in O(m2) time, the partial Fréchet distance between a segment and a polygonal curve of siz...
متن کاملImproved Approximation Algorithms for Stochastic Matching
In this paper we consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. We are given an undirected graph in which every edge is assigned a probability of existence and a positive profit, and each node is assigned a positive integer called timeout. We know whether an edge exists or not only after probing it. On this random graph we are ...
متن کاملImproved Streaming Algorithms for Weighted Matching, via Unweighted Matching
We present a (4 + ) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and MapReduce models; this single algorithm improves the previous best algorithm in each model. The algorithm operates by reducing the maximum-weight matching problem to a polylog number of copies of the maximum-cardinality matching problem. The algorithm also extends to p...
متن کاملPartial shape matching using genetic algorithms
Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9758-3